Hybrid Complementarity Formulations for Robotics Applications

نویسندگان

  • Kishor D. Bhalerao
  • Cory Crean
  • Kurt Anderson
چکیده

The focus of this paper is to review hybrid recursive-complementarity formulations for multibody systems characterized by a large number of bilateral constraints which are frequently encountered in robotics. Here, hybrid implies the use of complementarity contact models with recursive forward dynamics schemes. Such formulations have a common underlying structure which can be applied to multibody systems with a constrained tree-type topology. These common steps are pointed out. Theoretical formulation is given for systems using three important classes (O(n), O(n) and O(log(n))) of multibody algorithms. Further, numerical comparison for the efficiency is given for rigid multibody systems. The paper makes recommendations on the choice of hybrid complementarity formulations which would result in the most efficient simulation. The paper further gives a non-iterative approach to allow the use of explicit higher order integrators for frictionless contacts. The difficulties in extending this approach to allow for frictional contact are also discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid extreme point tabu search

We develop a new hybrid tabu search method for optimizing a continuous diieren-tiable function over the extreme points of a polyhedron. The method combines extreme point tabu search with traditional descent algorithms based on linear programming. The tabu search algorithm utilizes both recency-based and frequency-based memory and oscillates between local improvement and diversiication phases. T...

متن کامل

On the Solution of the Inverse Eigenvalue Complementarity Problem

In this paper, we discuss the solution of an Inverse Eigenvalue Complementarity Problem. Two nonlinear formulations are presented for this problem. A necessary and sufficient condition for a stationary point of the first of these formulations to be a solution of the problem is established. On the other hand, for assuring global convergence to a solution of this problem when it exists, an enumer...

متن کامل

Copositivity and constrained fractional quadratic problems

We provide Completely Positive and Copositive Optimization formulations for the Constrained Fractional Quadratic Problem (CFQP) and Standard Fractional Quadratic Problem (StFQP). Based on these formulations, Semidefinite Programming (SDP) relaxations are derived for finding good lower bounds to these fractional programs, which can be used in a global optimization branch-and-bound approach. Appl...

متن کامل

New Restricted NCP Functions and Their Applications to Stochastic NCP and Stochastic MPEC

We focus on studying stochastic nonlinear complementarity problems (SNCP) and stochastic mathematical programs with equilibrium constraints (SMPEC). Instead of the NCP functions employed in the literature, we use the restricted NCP functions to define expected residual minimization formulations for SNCP and SMPEC. We then discuss level set conditions and error bounds of the new formulation. Num...

متن کامل

Model Predictive Control for Linear Complementarity and Extended Linear Complementarity Systems

In this paper, we propose model predictive control method for linear complementarity and extended linear complementarity systems by formulating optimization along prediction horizon as mixed integer quadratic program. Such systems contain interaction between continuous dynamics and discrete event systems, and therefore, can be categorized as hybrid systems. As linear complementarity and extende...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010